#include<iostream>
using namespace std;
bool sesearch(int a[], int len,int num,int& Index)
{
	if (len < 0)
	{
		return false;
	}
	int i;
	for ( i = 0; i < len; i++)
	{
		if (a[i] == num)
		{
			Index = i;
		}
		
	}
	return true;
}
int main()
{
	int a[10] = { 1,2,3,4,5,6,7,8,9,10 };
	int Index;
	int len = sizeof(a) / sizeof(int);
	shunxusearch(a, len,1, Index);
	cout << "所要查找的元素在数组中的位置: " << Index << endl;
	return 0;
}